Effects of Clustering Algorithms on Typographic Reconstruction
Identifieur interne : 000390 ( Main/Exploration ); précédent : 000389; suivant : 000391Effects of Clustering Algorithms on Typographic Reconstruction
Auteurs : Elisa H. Barney Smith [États-Unis] ; Bart Lamiroy [France]Source :
English descriptors
Abstract
Type designers and historians studying the type-faces and fonts used in historical documents can usually only rely on available printed material. The initial wooden or metal cast fonts have mostly disappeared. In this paper we address the creation of character templates from printed documents. Images of characters scanned from Renaissance era documents are segmented, then clustered and a template is created from each obtained cluster of similar appearance characters. In order for subsequent typeface analysis tools to operate, the template should reduce the noise present in the individual instances by using information from the set of samples, but the samples must be homogeneous enough to not introduce further noise into the process. This paper evaluates the efficiency of several clustering algorithms and the associated parameters through cluster validity statistics and appearance of the resulting template image. Clustering algorithms that form tight clusters produce templates that highlight details, even though the number of available samples is smaller, while algorithms with larger clusters better capture the global shape of the characters.
Url:
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 001E52
- to stream Hal, to step Curation: 001E52
- to stream Hal, to step Checkpoint: 000362
- to stream Main, to step Merge: 000390
- to stream Main, to step Curation: 000390
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Effects of Clustering Algorithms on Typographic Reconstruction</title>
<author><name sortKey="Barney Smith, Elisa H" sort="Barney Smith, Elisa H" uniqKey="Barney Smith E" first="Elisa H." last="Barney Smith">Elisa H. Barney Smith</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-155609" status="VALID"><orgName>Signal Processing Lab [Boise - Idaho]</orgName>
<desc><address><addrLine>Department of Electrical and Computer Engineering 1910 University Drive Boise</addrLine>
<country key="US"></country>
</address>
</desc>
<listRelation><relation active="#struct-310033" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-310033" type="direct"><org type="institution" xml:id="struct-310033" status="INCOMING"><orgName>Boise State University</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Lamiroy, Bart" sort="Lamiroy, Bart" uniqKey="Lamiroy B" first="Bart" last="Lamiroy">Bart Lamiroy</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-206044" status="VALID"><orgName>Querying Graphics through Analysis and Recognition</orgName>
<orgName type="acronym">QGAR</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://qgar.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-423086" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-423086" type="direct"><org type="department" xml:id="struct-423086" status="VALID"><orgName>Department of Natural Language Processing & Knowledge Discovery</orgName>
<orgName type="acronym">LORIA - NLPKD</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/Knowledge-and-Language-Management</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01154603</idno>
<idno type="halId">hal-01154603</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-01154603</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-01154603</idno>
<date when="2015-08-23">2015-08-23</date>
<idno type="wicri:Area/Hal/Corpus">001E52</idno>
<idno type="wicri:Area/Hal/Curation">001E52</idno>
<idno type="wicri:Area/Hal/Checkpoint">000362</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000362</idno>
<idno type="wicri:Area/Main/Merge">000390</idno>
<idno type="wicri:Area/Main/Curation">000390</idno>
<idno type="wicri:Area/Main/Exploration">000390</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Effects of Clustering Algorithms on Typographic Reconstruction</title>
<author><name sortKey="Barney Smith, Elisa H" sort="Barney Smith, Elisa H" uniqKey="Barney Smith E" first="Elisa H." last="Barney Smith">Elisa H. Barney Smith</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-155609" status="VALID"><orgName>Signal Processing Lab [Boise - Idaho]</orgName>
<desc><address><addrLine>Department of Electrical and Computer Engineering 1910 University Drive Boise</addrLine>
<country key="US"></country>
</address>
</desc>
<listRelation><relation active="#struct-310033" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-310033" type="direct"><org type="institution" xml:id="struct-310033" status="INCOMING"><orgName>Boise State University</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Lamiroy, Bart" sort="Lamiroy, Bart" uniqKey="Lamiroy B" first="Bart" last="Lamiroy">Bart Lamiroy</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-206044" status="VALID"><orgName>Querying Graphics through Analysis and Recognition</orgName>
<orgName type="acronym">QGAR</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://qgar.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-423086" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-423086" type="direct"><org type="department" xml:id="struct-423086" status="VALID"><orgName>Department of Natural Language Processing & Knowledge Discovery</orgName>
<orgName type="acronym">LORIA - NLPKD</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/Knowledge-and-Language-Management</ref>
</desc>
<listRelation><relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect"><org type="laboratory" xml:id="struct-206040" status="VALID"><idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>document analysis</term>
<term>image analysis</term>
<term>shape analysis</term>
<term>typography</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Type designers and historians studying the type-faces and fonts used in historical documents can usually only rely on available printed material. The initial wooden or metal cast fonts have mostly disappeared. In this paper we address the creation of character templates from printed documents. Images of characters scanned from Renaissance era documents are segmented, then clustered and a template is created from each obtained cluster of similar appearance characters. In order for subsequent typeface analysis tools to operate, the template should reduce the noise present in the individual instances by using information from the set of samples, but the samples must be homogeneous enough to not introduce further noise into the process. This paper evaluates the efficiency of several clustering algorithms and the associated parameters through cluster validity statistics and appearance of the resulting template image. Clustering algorithms that form tight clusters produce templates that highlight details, even though the number of available samples is smaller, while algorithms with larger clusters better capture the global shape of the characters.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
<li>États-Unis</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Metz</li>
<li>Nancy</li>
</settlement>
<orgName><li>Université de Lorraine</li>
</orgName>
</list>
<tree><country name="États-Unis"><noRegion><name sortKey="Barney Smith, Elisa H" sort="Barney Smith, Elisa H" uniqKey="Barney Smith E" first="Elisa H." last="Barney Smith">Elisa H. Barney Smith</name>
</noRegion>
</country>
<country name="France"><region name="Grand Est"><name sortKey="Lamiroy, Bart" sort="Lamiroy, Bart" uniqKey="Lamiroy B" first="Bart" last="Lamiroy">Bart Lamiroy</name>
</region>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000390 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000390 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= Hal:hal-01154603 |texte= Effects of Clustering Algorithms on Typographic Reconstruction }}
This area was generated with Dilib version V0.6.33. |